A Review Paper on an Embedded Extended Visual Cryptography Scheme for Color Image Using Lpg with Pca

نویسندگان

  • Navdeep Kaur
  • Gagandeep Singh
چکیده

A method for creating digital image copyright protection is proposed in this paper. The proposed method in this paper is based on visual cryptography using LPG with PCA. The proposed method is working on selection of random pixels from the original digital image instead of specific selection of pixels.In today’s scenario protection of digital data is utmost necessary in every part of life. More robust methods are being developed to protect the proprietary rights of the multimedia. In this paper, an invisible watermarking technique is proposed, to embed multiple binary watermarks into digital medical images based on the concept of Visual Cryptography (VC). The proposed scheme embeds the watermarks without modifying the original host image. Cryptography is nothing but the secret sharing of text. Similarly Visual Cryptography Scheme (VCS) is secret sharing of images. The extension of VCS is Embedded Extended Visual Cryptography. A secret image is divided into shares and stacking of the shares will reveal the secret image. The recovered secret image quality is less in terms of loss of resolution and contrast. In this paper we introduce An Embedded Extended Visual Cryptography Scheme for Color Image using LPG with PCA; this can help to improve the visual quality of the recovered image.Because of local pixel groping with Principal component Analysis(PCA) because of this we able to embed and extract multiple secret image with very good quality.. This work has been tested and found suitable for its purpose.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

فشرده‌سازی تصویر با کمک حذف و کدگذاری هوشمندانه اطلاعات تصویر و بازسازی آن با استفاده از الگوریتم های ترمیم تصویر

Compression can be done by lossy or lossless methods. The lossy methods have been used more widely than the lossless compression. Although, many methods for image compression have been proposed yet, the methods using intelligent skipping proper to the visual models has not been considered in the literature. Image inpainting refers to the application of sophisticated algorithms to replace lost o...

متن کامل

مطالعه‌ای بر رمز‌نگاری بصری و ارائه‌ی روش پیشنهادی برای رمزنگاری تصاویر رنگی

Visual cryptography is a method that makes use of the characteristics of human vision and it requires neither the knowledge of cryptography nor the complex calculations. This method was first proposed by Naor and Shamir, its implementation is simple, it has been extended to an secrect sharing (k, n) in which n shares are made from the image and they are distributed among n participants. Moreov...

متن کامل

Maximal Independent Sets for the Pixel Expansion of Graph Access Structure

 Abstract : A visual cryptography scheme based on a given graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper a maximal independent sets of the graph G was ...

متن کامل

On the Analysis and Generalization of Extended Visual Cryptography Schemes

An Extended Visual Cryptography Scheme (EVCS) was proposed by Ateniese et al. [3] to protect a binary secret image with meaningful (innocent-looking) shares. This is implemented by concatenating an extended matrix to each basis matrix. The minimum size of the extended matrix was obtained from a hypergraph coloring model and the scheme was designed for binary images only [3]. In this paper, we g...

متن کامل

MAXIMAL INDEPENDENT SETS FOR THE PIXEL EXPANSION OF GRAPH ACCESS STRUCTURE

Given a graph G, a visual cryptography scheme based on the graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper we apply maximal independent sets of the grap...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016